Anomalous diffusion with log-periodic modulation in a selected time interval

On certain self-similar substrates the time behavior of a random walk is modulated by logarithmic periodic oscillations on all time scales. We show that if disorder is introduced in a way that self-similarity holds only in average, the modulating oscillations are washed out but subdiffusion remains as in the perfect self-similar case. Also, if disorder distribution is appropriately chosen the oscillations are localized in a selected time interval. Both the overall random walk exponent and the period of the oscillations are analytically obtained and confirmed by Monte Carlo simulations.Comment: 4 pages, 5 figure

On the positive eigenvalues and eigenvectors of a non-negative matrix

The paper develops the general theory for the items in the title, assuming that the matrix is countable and cofinal.Comment: Version 2 allows the matrix to have zero row(s) and rows with infinitely many non-zero entries. In addition the introduction has been rewritte

Anisotropic anomalous diffusion modulated by log-periodic oscillations

We introduce finite ramified self-affine substrates in two dimensions with a set of appropriate hopping rates between nearest-neighbor sites, where the diffusion of a single random walk presents an anomalous {\it anisotropic} behavior modulated by log-periodic oscillations. The anisotropy is revealed by two different random walk exponents, $\nu_x$ and $\nu_y$, in the {\it x} and {\it y} direction, respectively. The values of these exponents, as well as the period of the oscillation, are analytically obtained and confirmed by Monte Carlo simulations.Comment: 7 pages, 7 figure

Spectral partitions on infinite graphs

Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well defined spectral dimensions and spectral weights. These subgraphs are shown to be thermodynamically homogeneous and effectively decoupled.Comment: 8 pages, to appear on Journal of Physics

Quantum walk approach to search on fractal structures

We study continuous-time quantum walks mimicking the quantum search based on Grover's procedure. This allows us to consider structures, that is, databases, with arbitrary topological arrangements of their entries. We show that the topological structure of the database plays a crucial role by analyzing, both analytically and numerically, the transition from the ground to the first excited state of the Hamiltonian associated with different (fractal) structures. Additionally, we use the probability of successfully finding a specific target as another indicator of the importance of the topological structure.Comment: 15 pages, 14 figure

Diffusion on asymmetric fractal networks

We derive a renormalization method to calculate the spectral dimension $\bar{d}$ of deterministic self-similar networks with arbitrary base units and branching constants. The generality of the method allows the affect of a multitude of microstructural details to be quantitatively investigated. In addition to providing new models for physical networks, the results allow precise tests of theories of diffusive transport. For example, the properties of a class of non-recurrent trees ($\bar{d}>2$) with asymmetric elements and branching violate the Alexander Orbach scaling law

Conjugacy in Baumslag's group, generic case complexity, and division in power circuits

The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} = y in G. The conjugacy problem is more difficult than the word problem, in general. We investigate the complexity of the conjugacy problem for two prominent groups: the Baumslag-Solitar group BS(1,2) and the Baumslag(-Gersten) group G(1,2). The conjugacy problem in BS(1,2) is TC^0-complete. To the best of our knowledge BS(1,2) is the first natural infinite non-commutative group where such a precise and low complexity is shown. The Baumslag group G(1,2) is an HNN-extension of BS(1,2). We show that the conjugacy problem is decidable (which has been known before); but our results go far beyond decidability. In particular, we are able to show that conjugacy in G(1,2) can be solved in polynomial time in a strongly generic setting. This means that essentially for all inputs conjugacy in G(1,2) can be decided efficiently. In contrast, we show that under a plausible assumption the average case complexity of the same problem is non-elementary. Moreover, we provide a lower bound for the conjugacy problem in G(1,2) by reducing the division problem in power circuits to the conjugacy problem in G(1,2). The complexity of the division problem in power circuits is an open and interesting problem in integer arithmetic.Comment: Section 5 added: We show that an HNN extension G = < H, b | bab^-1 = {\phi}(a), a \in A > has a non-amenable Schreier graph with respect to the base group H if and only if A \neq H \neq

Survival, extinction and approximation of discrete-time branching random walks

We consider a general discrete-time branching random walk on a countable set X. We relate local, strong local and global survival with suitable inequalities involving the first-moment matrix M of the process. In particular we prove that, while the local behavior is characterized by M, the global behavior cannot be completely described in terms of properties involving M alone. Moreover we show that locally surviving branching random walks can be approximated by sequences of spatially confined and stochastically dominated branching random walks which eventually survive locally if the (possibly finite) state space is large enough. An analogous result can be achieved by approximating a branching random walk by a sequence of multitype contact processes and allowing a sufficiently large number of particles per site. We compare these results with the ones obtained in the continuous-time case and we give some examples and counterexamples.Comment: 32 pages, a few misprints have been correcte

On conformal measures and harmonic functions for group extensions

We prove a Perron-Frobenius-Ruelle theorem for group extensions of topological Markov chains based on a construction of $\sigma$-finite conformal measures and give applications to the construction of harmonic functions.Comment: To appear in Proceedings of "New Trends in Onedimensional Dynamics, celebrating the 70th birthday of Welington de Melo

Ring structures and mean first passage time in networks

In this paper we address the problem of the calculation of the mean first passage time (MFPT) on generic graphs. We focus in particular on the mean first passage time on a node 's' for a random walker starting from a generic, unknown, node 'x'. We introduce an approximate scheme of calculation which maps the original process in a Markov process in the space of the so-called rings, described by a transition matrix of size O(ln N / ln X ln N / ln), where N is the size of the graph and the average degree in the graph. In this way one has a drastic reduction of degrees of freedom with respect to the size N of the transition matrix of the original process, corresponding to an extremely-low computational cost. We first apply the method to the Erdos-Renyi random graph for which the method allows for almost perfect agreement with numerical simulations. Then we extend the approach to the Barabasi-Albert graph, as an example of scale-free graph, for which one obtains excellent results. Finally we test the method with two real world graphs, Internet and a network of the brain, for which we obtain accurate results.Comment: 8 pages, 8 figure